A geometric method of sector decomposition
نویسندگان
چکیده
منابع مشابه
A geometric method of sector decomposition
We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method provides a deterministic algorithm and never falls into an infinite loop. The number of resulting sectors depends on the algorithm of triangulation. Our test imple...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Sector Decomposition
Sector decomposition is a constructive method to isolate divergences from parameter integrals occurring in perturbative quantum field theory. We explain the general algorithm in detail and review its application to multi-loop Feynman parameter integrals as well as infrared divergent phase-space integrals over real radiation matrix elements.
متن کاملA Geometric Study of the Split Decomposition
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete concave functions, Bandelt-Dress’ split decomposition can be derived as a special case of more general decomposition of polyhedral/discrete concave functions introduced in this paper. It is shown that the combinatorics...
متن کاملDecomposition of Geometric Constraint Systems: a Survey
Significant progress has been accomplished during the past decades about geometric constraint solving, in particular thanks to its applications in industrial fields like CAD and robotics. In order to tackle problems of industrial size, many solving methods use, as a preprocessing, decomposition techniques that transform a large geometric constraint system into a set of smaller ones. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2010
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2010.04.001